Deterministic Consensus Algorithm with Linear Per-Bit Complexity

摘要

In this report, building on the deterministic multi-valued one-to-manyByzantine agreement (broadcast) algorithm in our recent technical report [2],we introduce a deterministic multi-valued all-to-all Byzantine agreementalgorithm (consensus), with linear complexity per bit agreed upon. Thediscussion in this note is not self-contained, and relies heavily on thematerial in [2] - please refer to [2] for the necessary background.